Computational miRNomics
نویسندگان
چکیده
منابع مشابه
miRNomics-The bioinformatics of microRNA genes.
MicroRNAs (miRNAs) are tiny genetic rheostats in plants, animals, and viruses, regulating the expression of messenger RNAs by targeting transcripts for cleavage or translational repression. Their regulatory impact is even more pervasive as a potential therapeutic tool. Since inception, computational methods have been an invaluable tool complementing experimental approaches. Here, we outline miR...
متن کاملPaired proteomics, transcriptomics and miRNomics in non-small cell lung cancers: known and novel signaling cascades
High-throughput omics analyses are applied to elucidate molecular pathogenic mechanisms in cancer. Given restricted cohort sizes and contrasting large feature sets paired multi-omics analysis supports discovery of true positive deregulated signaling cascades. For lung cancer patients we measured from the same tissue biopsies proteomic- (6,183 proteins), transcriptomic- (34,687 genes) and miRNom...
متن کاملComputational Emergence and Computational Emotion
This paper presents an analysis of the issues pertaining to computational emergence and emotion in (cognitive) agent systems whether their ecology is carbon or silicon-based. We consider how a developing computational theory of cognition can be used to monitor and manage interactions with and within complex systems and so harness unwanted and emergent states and behaviours before the computatio...
متن کاملComputational Irreducibility and Computational Analogy
In a previous paper [21], we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than computing successively all the values f(i) from i=1 to n. Our definition is based on the concept of E-Turing machines (for Enumerating Turing Machines) ...
متن کاملAn automaton group: a computational case study
We introduce a two generated weakly branch contracting automaton group $G$ which is generated by a two state automaton on a three letter alphabet. Using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. Furthermore some algebraic properties of $G$ are detected .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Integrative Bioinformatics
سال: 2016
ISSN: 1613-4516
DOI: 10.1515/jib-2016-302